A quantum complexity lower bound from differential geometry
نویسندگان
چکیده
The Bishop-Gromov bound -- a cousin of the focusing lemmas that Hawking and Penrose used to prove their black hole singularity theorems is differential geometry result upperbounds rate growth volume geodesic balls in terms Ricci curvature. In this paper, I apply Nielsen's complexity lowerbounds on quantum typical unitary. For broad class penalty schedules, shown be exponentially large number qubits. This technique gives results are tighter than all known literature, as well establishing for much broader metrics has hitherto been bounded. some metrics, these tight. method realizes original vision Nielsen, which was tools study complexity.
منابع مشابه
Lower Neutrino Mass Bound from SN1987A Data and Quantum Geometry
A lower bound on the light neutrino mass mν is derived in the framework of a geometrical interpretation of quantum mechanics. Using this model and the time of flight delay data for neutrinos coming from SN1987A, we find that the neutrino masses are bounded from below by mν ∼ 10−4−10−3eV, in agreement with the upper bound mν ∼ (O(0.1)−O(1)) eV currently available. When the model is applied to ph...
متن کاملA Lower Bound on Entanglement-Assisted Quantum Communication Complexity
We prove a general lower bound on the bounded-error entanglement-assisted quantum communication complexity of Boolean functions. The bound is based on the concept that any classical or quantum protocol to evaluate a function on distributed inputs can be turned into a quantum communication protocol. As an application of this bound, we give a very simple proof of the statement that almost all Boo...
متن کاملQuantum Formulas: A Lower Bound and Simulation
We show that Nechiporuk’s method [26] for proving lower bounds for Boolean formulas can be extended to the quantum case. This leads to an Ω(n/ log n) lower bound for quantum formulas computing an explicit function. The only known previous explicit lower bound for quantum formulas [27] states that the majority function does not have a linear–size quantum formula. We also show that quantum formul...
متن کاملA Lower Bound for Quantum Phase Estimation
We obtain a query lower bound for quantum algorithms solving the phase estimation problem. Our analysis generalizes existing lower bound approaches to the case where the oracle Q is given by controlled powers Q of Q, as it is for example in Shor’s order finding algorithm. In this setting we will prove a Ω(log 1/ǫ) lower bound for the number of applications of Q1 , Q2 , . . .. This bound is tigh...
متن کاملQuantum lower bound for sorting ∗
Needless to say, sorting, especially sorting by comparisons, has been a classical problem in computer science. Despite its enormous importance, the complexity, in terms of the number of comparisons needed, is simple to analyze. Straightforward information theoretical argument gives the tight lower bound of log2(n!), which is achieved by several simple sorting algorithms, for example, Insertion ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature Physics
سال: 2023
ISSN: ['1745-2473', '1745-2481']
DOI: https://doi.org/10.1038/s41567-022-01884-6